Generalized Matrix Graphs and Completely Independent Critical Cliques
نویسندگان
چکیده
A -dimensional -square matrix is defined and certain properties of such matrices are investigated. Two particular graph constructions involving -dimensional -square matrices are given and the graphs so constructed are called matrix graphs. Properties of matrix graphs are determined and an application of matrix graphs to completely independent critical clique is provided. Some attention is given to this application and its relationship with the double-critical conjecture that the only vertex double-critical graph is the complete graph.
منابع مشابه
Generalized matrix graphs and completely independent critical cliques in any dimension
For natural numbers k and n, where 2 ≤ k ≤ n, the vertices of a graph are labeled using the elements of the k-fold Cartesian product In× In×· · ·× In. Two particular graph constructions will be given and the graphs so constructed are called generalized matrix graphs. Properties of generalized matrix graphs are determined and their application to completely independent critical cliques is invest...
متن کاملGeneralized bilinear forms graphs and MDR codes over residue class rings
We investigate the generalized bilinear forms graph Γd over a residue class ring Zps . We show that Γd is a connected vertex transitive graph, and completely determine its independence number, clique number, chromatic number and maximum cliques. We also prove that cores of both Γd and its complement are maximum cliques. The graph Γd is useful for error-correcting codes. We show that every large...
متن کاملPartitions of Generalized Split Graphs
We discuss matrix partition problems for graphs that admit a partition into k independent sets and ` cliques. We show that when k + ` 6 2, any matrix M has finitely many (k, `) minimal obstructions and hence all of these problems are polynomial time solvable. We provide upper bounds for the size of any (k, `) minimal obstruction when k = ` = 1 (split graphs), when k = 2, ` = 0 (bipartite graphs...
متن کاملList Partitions of Chordal Graphs
In an earlier paper we gave efficient algorithms for partitioning chordal graphs into k independent sets and l cliques. This is a natural generalization of the problem of recognizing split graphs, and is NPcomplete for graphs in general, unless k ≤ 2 and l ≤ 2. (Split graphs have k = l = 1.) In this paper we expand our focus and consider generalM -partitions, also known as trigraph homomorphism...
متن کاملOn t-Cliques in k-Walk-Regular Graphs
A graph is walk-regular if the number of cycles of length ` rooted at a given vertex is a constant through all the vertices. For a walk-regular graph G with d + 1 different eigenvalues and spectrally maximum diameter D = d, we study the geometry of its d-cliques, that is, the sets of vertices which are mutually at distance d. When these vertices are projected onto an eigenspace of its adjacency...
متن کامل